On mixed-type reverse-order laws for the Moore-Penrose inverse of a matrix product

نویسنده

  • Yongge Tian
چکیده

If A and B are a pair of invertible matrices of the same size, then the product AB is nonsingular, too, and the inverse of the product AB satisfies the reverse-order law (AB)−1 = B−1A−1. This law can be used to find the properties of (AB)−1, as well as to simplify various matrix expressions that involve the inverse of a matrix product. However, this formula cannot trivially be extended to the Moore-Penrose inverse of matrix products. For a generalm×n complex matrix A, the Moore-Penrose inverse A† of A is the unique n×m matrix X that satisfies the following four Penrose equations: (i) AXA=A, (ii) XAX =X, (iii) (AX)∗ =AX, (iv) (XA)∗ =XA, where (·)∗ denotes the conjugate transpose of a complex matrix. A matrix X is called a {1}-inverse (inner inverse) ofA if it satisfies (i) and is denoted byA−. General properties of the Moore-Penrose inverse can be found in [2, 4, 16]. LetA and B be a pair of matrices such thatAB exists. In many situations, one needs to find the Moore-Penrose inverse of the product AB and its properties. Because A†A, BB†, and BB†A†A are not necessarily identity matrices, the relationship between (AB)† and B†A† is quite complicated and the reverse-order law (AB)† = B†A† does not necessarily hold. Therefore, it is not easy to simplify matrix expressions that involve the MoorePenrose inverse of matrix products. Theoretically speaking, for any matrix product AB, the Moore-Penrose inverse (AB)† can be written as (AB)† = B†A† or (AB)† = B†A†+X, (1)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse

A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.

متن کامل

The reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules

Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...

متن کامل

Products Of EP Operators On Hilbert C*-Modules

In this paper, the special attention is given to the  product of two  modular operators, and when at least one of them is EP, some interesting results is made, so the equivalent conditions are presented  that imply  the product of operators is EP. Also, some conditions are provided, for which the reverse order law is hold. Furthermore, it is proved  that $P(RPQ)$ is idempotent, if $RPQ$†</...

متن کامل

Ela Fast Computing of the Moore - Penrose Inverse Matrix

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.

متن کامل

Fast computing of the Moore-Penrose inverse matrix

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004